constNJ: An Algorithm to Reconstruct Sets of Phylogenetic Trees Satisfying Pairwise Topological Constraints
نویسندگان
چکیده
منابع مشابه
constNJ: An Algorithm to Reconstruct Sets of Phylogenetic Trees Satisfying Pairwise Topological Constraints
This article introduces constNJ (constrained neighbor-joining), an algorithm for phylogenetic reconstruction of sets of trees with constrained pairwise rooted subtree-prune-regraft (rSPR) distance. We are motivated by the problem of constructing sets of trees that must fit into a recombination, hybridization, or similar network. Rather than first finding a set of trees that are optimal accordin...
متن کاملThreeTree: A New Method to Reconstruct Phylogenetic Trees
Numerous methods have been invented to reconstruct phylogenetic trees. However, criteria used here may not necessarily suitable in actual biological data. On the other hand, if we obtain the same result from methods based on different criteria, the inference can be considered to be robust and reliable. Therefore, some complementary method to existing methods will improve accuracy at inference o...
متن کاملA Randomized Algorithm for Comparing Sets of Phylogenetic Trees
Phylogenetic analysis often produce a large number of candidate evolutionary trees, each a hypothesis of the ”true” tree. Post-processing techniques such as strict consensus trees are widely used to summarize the evolutionary relationships into a single tree. However, valuable information is lost during the summarization process. A more elementary step is produce estimates of the topological di...
متن کاملSatisfying ternary permutation constraints by multiple linear orders or phylogenetic trees
A ternary permutation constraint satisfaction problem (CSP) is specified by a subset Π of the symmetric group S3. An instance of such a problem consists of a set of variables V and a set of constraints C, where each constraint is an ordered triple of distinct elements from V . The goal is to construct a linear order α on V such that, for each constraint (a, b, c) ∈ C, the ordering of a, b, c in...
متن کاملConfidence sets for phylogenetic trees
Inferring evolutionary histories (phylogenetic trees) has important applications in biology, criminology and public health. However, phylogenetic trees are complex mathematical objects that reside in a non-Euclidean space, which complicates their analysis. While our mathematical, algorithmic, and probabilistic understanding of the behavior of phylogenies in their metric space is relatively matu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Biology
سال: 2010
ISSN: 1066-5277,1557-8666
DOI: 10.1089/cmb.2009.0201